Bounds for Robust Metering Schemes and Their Relationship with A2-code
نویسندگان
چکیده
A metering scheme allows a correct counting on the number of hits that a Web site received during a certain period. In this paper, we first derive tight lower bounds on the communication complexity |Vi| (i = 1, . . . , n) and the size of server’s secrets |Es| for robust and perfect (k, n)-metering schemes. We next show an almost equivalence between (k, n)-metering schemes and k-multiple-use A-codes. Finally, by using this equivalence, we derive lower bounds on |Vi| and |Es| for robust (but not necessarily perfect) (k, n)-metering schemes.
منابع مشابه
Bounds for Robust Metering Schemes and Their Relationship with A-code
A metering scheme allows a correct counting on the number of hits that a Web site received during a certain period. In this paper, we first derive tight lower bounds on the communication complexity |Vi| (i = 1, . . . , n) and the size of server’s secrets |Es| for robust and perfect (k, n)-metering schemes. We next show an almost equivalence between (k, n)-metering schemes and k-multiple-use A-c...
متن کاملRobust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique
The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...
متن کاملA Linear Algebraic Approach to Metering Schemes
A metering scheme is a method by which an audit agency is able to measure the interaction between servers and clients during a certain number of time frames. Naor and Pinkas 21] proposed metering schemes where any server is able to compute a proof, i.e., a value to be shown to the audit agency at the end of each time frame, if and only if it has been visited by a number of clients larger than o...
متن کاملDynamic Multi-threshold Metering Schemes
A metering scheme is a method by which an audit agency is able to measure the interaction between clients and servers on the web during a certain number of time frames. Naor and Pinkas 7] considered metering schemes in which any server is able to construct a proof to be sent to the audit agency if and only if it has been visited by at least a number, say h, of clients in a given time frame. In ...
متن کاملEecient Metering Schemes with Pricing
In order to decide on advertisement fees for web servers, Naor and Pinkas 7] introduced metering schemes. They proposed metering schemes in which any server is able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number, say h, of clients. Afterwards, the authors of 3] generalized the idea of Naor and Pinkas and proposed metering schem...
متن کامل